#pragma once
#include<stdio.h>
#include<iostream>
#include<stdlib.h>
#include<string.h>
using namespace std;
void PreOrderTraverse(BinTree T);
void InOrderTraverse(BiTree T);
void BackOrderTraverse(BinTree T);
BinTreeNode* createTreeNode();
createBinaryTree();
preOrder();
inOrder();
postOrder();
countLeaves();
freeBinaryTree();
